Performance Veriication Using Pdl and Constraint Satisfaction

نویسندگان

  • William L. Bradley
  • Ranga R. Vemuri
چکیده

The performance description language PDL provides a compact notation for the speciication of non-functional attributes of VLSI systems. This paper presents evaluation mechanisms which allow the designer to assert performance goals on PDL models of VLSI systems and determine if the constrained models are satissable. This is done by developing a PDL performance model and constructing a constraint satisfaction problem from the system of dependencies. This allows the designer to verify that an implementation of a VLSI system can satisfy all performance goals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Veri cation Using PDLand Constraint Satisfaction 1

The performance description language PDL provides a compact notation for the speciication of non-functional attributes of VLSI systems. This paper presents evaluation mechanisms which allow the designer to assert performance goals on PDL models of VLSI systems and determine if the constrained models are satissable. This is done by developing a PDL performance model and constructing a constraint...

متن کامل

8 Conclusions

When a VLSI system is being developed, the designer must make sure an implementation meets all design goals, including performance goals. Here we present a set of algorithms which use the performance description language PDL to generate constraint satisfaction problems upon which the performance goals can be directly asserted. Algorithms then check these CSPs for satissability. If a CSP is sati...

متن کامل

Speciication and Veriication of Constraint-based Dynamic Systems 1 Motivation and Introduction

Constraint satisfaction can be seen as a dynamic process that approaches the solution set of the given constraints asymptotically 6]. Constraint programming is seen as creating a dynamic system with the required property. We have developed a semantic model for dynamic systems, Constraint Nets, which serves as a useful abstract target machine for constraint programming languages, providing both ...

متن کامل

Local Veri cation of Global Integrity Constraints in

We present an optimization for integrity constraint veriication in distributed databases. The optimization allows a global constraint, i.e. a constraint spanning multiple databases, to be veriied by accessing data at a single database, eliminating the cost of accessing remote data. The optimization is based on an algorithm that takes as input a global constraint and data to be inserted into a l...

متن کامل

Toward a Provably - Correct Implementation of the JVMBytecode Veri

This paper reports on our ongoing eeorts to realize a provably-correct implementation of the Java Virtual Machine bytecode veriier. We take the perspective that bytecode veriication is a dataaow analysis problem, or more generally, a constraint solving problem on lattices. We employ Specware, a system available from Kestrel Institute that supports the development of programs from speciications,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995